ALGORITHM FOR OPTIMAL SYMBOL-BY-SYMBOL RECEPTION OF FREQUENCY-EFFICIENT SIGNALS WITH CORRECTION CODES IN NON-BINARY GALOIS FIELDS
نویسندگان
چکیده
The description of the developed algorithm for optimal symbol-by-symbol reception signal structures based on frequency-efficient signals with two-dimensional «constellations» intensively used in applications and block correction codes non-binary Galois fields is given. It shown that minimizes error probability code symbol or information bit contrast to well-known maximum likelihood rule which error-probability word. proved basis this decoding spectral transform Walsh-Hadamard resulting complexity determined by dimension dual makes it promising a high rate (with low redundancy). study error-performance characteristics (probability erroneous bit) considered was carried out simulating multilevel phase shift keying (PSK-16 signals) quadrature amplitude manipulation (QAM-16 simple correcting general parity check field size 16. use provides an energy gain from 0.00001 1.25…1.5 relation without coding. As decreases gains increase.
منابع مشابه
An optimum symbol-by-symbol decoding rule for linear codes
A decoding rule is presented which minimizes the probability of symbol error over a time-discrete memoryless channel for any linear error-correcting code when the code words are equiprobable. The complexity of this rule varies inversely with code rate, making the technique particularly attractive for high rate codes. Examples are given for both block and convolutional codes.
متن کاملSymbol Erasure Correction Capability of Spread Codes
We consider data transmission over a network where each edge is an erasure channel and where the inner nodes transmit a random linear combination of their incoming information. We distinguish two channel models in this setting, the row and the column erasure channel model. For both models we derive the symbol erasure correction capabilities of spread codes and compare them to other known codes ...
متن کاملSymbol-by-Symbol MAP Decoding of Variable Length Codes
In this paper we introduce a new approach in the decoding of variable length codes. Based on the tree structure of these codes a trellis representation is derived which allows the application of the BCJR algorithm. This algorithm provides us with the a posteriori probabilities of the transmitted source symbols. Therefore we do not only use soft information from an outer decoding stage but also ...
متن کاملSymbol-by-Symbol MAP Decoding of Nonbinary Codes
Symbol-by-symbol maximum a posteriori (MAP) decoding algorithms for linear nonbinary block and convolutional codes over both extension elds GF(q = p a) and integer rings Z q are presented. Equivalent MAP decoding rules employing the dual code are given which are computationally more eecient for high-rate codes. The suitabil-ity of the proposed algorithms is demonstrated by applying them to a pa...
متن کاملOptimal Decoding of Linear Codes for Minimizing Symbol
The previous are identical to the expressions (2) and (3). Thus the n 1 columns do consist of two repetitions of 2”-r-level Gray code. Now if we combine the first two columns again, we reduce each 2”-‘-level Gray code into two 2n-2-level Gray codes, or, the complete array into four 2”-2-level Gray codes. This can continue until we have only m columns, which would be 2n-m repetitions of 2”‘-leve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of radio electronics
سال: 2022
ISSN: ['1684-1719']
DOI: https://doi.org/10.30898/1684-1719.2022.10.6